The Nonexistence of a Distance-Regular Graph with Intersection Array {22, 16, 5;1, 2, 20}
نویسندگان
چکیده
We prove that a distance-regular graph with intersection array {22, 16, 5; 1, 2, 20} does not exist. To prove this, we assume that such a graph exists and derive some combinatorial properties of its local graph. Then we construct a partial linear space from the local graph to display the contradiction.
منابع مشابه
The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10;1, 2, 18} and {36, 28, 4;1, 2, 24}
Locally, a distance-regular graph with ‘μ = 2’ carries the structure of a partial linear space. Using this, we show that there are no distanceregular graphs with intersection array {27, 20, 10; 1, 2, 18} or {36, 28, 4; 1, 2, 24} (on, respectively, 448 or 625 vertices).
متن کاملUsing symbolic computation to prove nonexistence of distance-regular graphs
A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array {(2r + 1)(4r + 1)(4t− 1), 8r(4rt− r + 2t), (r + t)(4r + 1); 1, (r + t)(4r + 1), 4r(2r + 1)(4t− 1)} (r, t ≥ 1), {135,128,16; 1,16,120}, {234,165,12; 1,30,198} or {5...
متن کاملUsing equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
We prove the nonexistence of a distance-regular graph with intersection array {74,54,15;1,9,60} and of distance-regular graphs with intersection arrays { 4r3 + 8r2 + 6r + 1,2r(r + 1)(2r + 1),2r2 + 2r + 1;1,2r(r + 1), (2r + 1)(2r2 + 2r + 1)} with r an integer and r 1. Both cases serve to illustrate a technique which can help in determining structural properties for distance-regular graphs and as...
متن کاملOn new completely regular q-ary codes
In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...
متن کاملA Distance-Regular Graph with Intersection Array (5, 4, 3, 3; 1, 1, 1, 2) Does Not Exist
We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely combinatorial and computer-free.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016